منابع مشابه
Rotary Polygons in Configurations
A polygon A in a configuration C is called rotary if C admits an automorphism which acts upon A as a one-step rotation. We study rotary polygons and their orbits under the group of automorphisms (and antimorphisms) of C. We determine the number of such orbits for several symmetry types of rotary polygons in the case when C is flag-transitive. As an example, we provide tables of flag-transitive ...
متن کاملSimultaneous containment of several polygons: analysis of the contact configurations
The main concern of thi s paper i s t he det ect i on of double-cont act con gur at i ons f or s ome pol ygons movi ng i n t r ans l at i on i n a pol ygonal envi r onment . We r s t es t abl i s h s ome gener al pr oper t i es about s uch con gur at i ons , and gi ve condi t i ons of exi s t ence of doubl econt act s f or two or t hr ee object s . We deduce an al gor i t hm det ect i ng s uch ...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملMaterial Flow in Rotary Drums
The experimental investigation of material flow in rotary drums is studied. An equipment in the size of pilot-scale was used to collect experimental data for investigation of validity of the conventional steady-state model of material flow in rotary drums. Also, the transient data of the time required for material movement in the empty drum up to any specified cross section are also reported. T...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/606